package main.java.indi.zyj.c150.dps;

import java.util.Scanner;

public class _10_EqTriangle {


    static int[] a = new int[110];
    static boolean[] selected = new boolean[110];
    static int n, k, sum;
    static boolean ans;


    static void Dfs(int cnt, int edge, int pos){
        if (ans){
            return;
        }
        if (cnt == 3){
            ans = true;
            return;
        }
        if (edge == sum/3){
            Dfs(cnt+1, 0, 0);
            return;
        }

        for (int i = pos; i < n; i++) {
            if (!selected[i]){
                selected[i] = true;
                Dfs(cnt+1, edge+a[i], i+1);
            }
        }

    }



    public static void main(String[] args) {


        Scanner scan = new Scanner(System.in);
        n = scan.nextInt();
        for (int i = 0; i < n; i++) {
            a[i] = scan.nextInt();
            sum += a[i];
        }

        if (sum%3 != 0){
            System.out.println("no!");
        }else {
            Dfs(0, 0, 0);
            if (ans){
                System.out.println("Yes!");
            }else {
                System.out.println("no!");
            }
        }


    }

}
